منابع مشابه
3D Point Cloud Upsampling for Accurate Reconstruction of Dense 2.5D Thickness Maps
This paper presents a novel robust processing methodology for computing 2.5D thickness maps from dense 3D collocated surfaces. The proposed pipeline is suitable to faithfully adjust data representation detailing as required, from preserving fine surface features to coarse interpretations. The foundations of the proposed technique exploit spatial point-based filtering, ray tracing techniques and...
متن کاملPU-Net: Point Cloud Upsampling Network
Learning and analyzing 3D point clouds with deep networks is challenging due to the sparseness and irregularity of the data. In this paper, we present a data-driven point cloud upsampling technique. The key idea is to learn multilevel features per point and expand the point set via a multibranch convolution unit implicitly in feature space. The expanded feature is then split to a multitude of f...
متن کاملDiscontinuity adaptive depth upsampling for 3D video acquisition
A new discontinuity adaptive depth upsampling method is proposed in order to obtain a high-resolution depth map. The proposed method adaptively employs both the local minimum filter and the joint bilateral filter according to the variance of the depth map. Thus, it can reduce the over-blurred depth regions along the depth discontinuities. The experimental results demonstrate the feasibility of ...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملColored Point Set Matching Under Noise in 3D
Let A and B be two colored points sets in R, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, between A and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. Our algorithm consists of two main stages. In the first one we generate all, up to a cert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2021
ISSN: 0013-5194,1350-911X
DOI: 10.1049/ell2.12096